Improved algorithms for two single machine scheduling problems
نویسندگان
چکیده
منابع مشابه
Single machine scheduling problems
In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملSingle-Machine two-agent scheduling problems with unconstrained strategies
We address a class of deterministic scheduling problems in which two agents compete for the usage of a single machine. The agents have their own objective functions and submit in each round an arbitrary, unprocessed task from their buffer for possible selection. In each round the shorter of the two submitted tasks is chosen and processed on the machine. We consider the problems under two distin...
متن کاملTwo Exponential Neighborhoods For Single Machine Scheduling
We study the problem of minimizing total completion time on a single machine with the presence of release dates. We present two different approaches leading to exponential neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.
متن کاملFast Algorithms for Two Scheduling Problems
The thesis deals with problems from two distint areas of scheduling theory. In the first part we consider the preemptive Sum Multicoloring (pSMC) problem. In an instance of pSMC, pairwise conflicting jobs are represented by a conflict graph, and the time demands of jobs are given by integer weights on the nodes. The goal is to schedule the jobs in such a way that the sum of their finish times i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.04.014